Optimization of Vehicle Routing and Scheduling Problem with Time Window Constraints in Hazardous Material Transportation
نویسندگان
چکیده
Unlike widely available literatures in hazardous material (HAZMAT) transportation that basically aim at finding non dominated paths for a given origin-destination pair, our main focus in this study is on vehicle routing problem with time window (VRPTW) aspect of HAZMAT transportation problem that has received very less attention in literatures. We present a new multi-objective optimization model and its meta-heuristic solution technique using Ant Colony System for HAZMAT routing. In contrast to existing local routing models, we consider minimization of risk and transportation cost in both route choice and routing phases of transportation process. Moreover, route choice and routing have been carried out as a single step process. Lastly, the proposed algorithm has been tested for normal VRPTW by testing on Solomon benchmark instances and the results obtained show that the proposed algorithm outperforms while maintaining realistic computation time.
منابع مشابه
An Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملA multi-product vehicle routing scheduling model with time window constraints for cross docking system under uncertainty: A fuzzy possibilistic-stochastic programming
Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...
متن کاملSupply Chain Scheduling Using a Transportation System Composed of Vehicle Routing Problem and Cross-Docking Approaches
This study considers a combination of cross-docking and vehicle routing problem (VRP) approachesto transport raw material and parts in a supply chain. The supply chain is composed of some supplierswhich are spread in different geographical zones and multiple shared vehicles with different speedsand capacities for transporting orders from the suppliers to a manufacturer. After ...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کامل